PSEUDO RANDOM NUMBER GENERATION USING EYE BRIGHTNESS RESPONSE
نویسندگان
چکیده
منابع مشابه
Novel Pseudo-random Number Generation Using Variant Logic Framework
Cyber Security requires cryptology for the basic protection. Among different ECRYPT technologies, stream cipher plays a central role in advanced network security applications; in addition, pseudo-random number generators are placed in the core position of the mechanism. In this paper, a novel method of pseudo-random number generation is proposed to take advantage of the large functional space d...
متن کاملA New Trend of Pseudo Random Number Generation using QKD
Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys. This paper utilizes the QKD to generate a random quantum bit rely on BB84 protocol, using the NIST and DIEHARD randomness test algorithms to test and evaluate the randomness rates for key gener...
متن کاملFinite Fields and Pseudo-Random Number Generation
The purpose of this set of notes is to show, as simply as possible, how the theory of finite fields applies to certain commonly used pseudo-random number generators. Only those parts of the theory of finite fields that are needed for this purpose are presented, and the development of the algebraic theory needed for this is greatly simplified for this purpose. I have tried to compose these notes...
متن کاملPseudo-Random Number Generators
The first option here is not easy. Some pieces of data of this kind exist, for example from the decay of radioactive elements, but generally generation is slow and you cannot get the quantity of random numbers you require for modern applications. The second option here is what I’ll talk about today. Algorithms of this type are called “PseudoRandom Number Generators” (PRNGs). Many bad algorithms...
متن کاملEfficient and Secure Pseudo-Random Number Generation (Extended Abstract)
Cryptographically secure pseudorandom number generators known so far suffer from the handicap of being inefficient; the most efficient ones can generate only one bit on each modular multiplication (n2 steps). Hum, Blum and Shub ask the open problem of outputting even two bits securely. We state a simple condition, the XORCondition. and show that any generator satisfying this condition can outpu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICTACT Journal on Communication Technology
سال: 2018
ISSN: 0976-0091,2229-6948
DOI: 10.21917/ijct.2018.0259